منابع مشابه
Packing paths in digraphs
Let G be a xed collection of digraphs. Given a digraph H, a Gpacking of H is a collection of vertex disjoint subgraphs of H, each isomorphic to a member of G. A G-packing, P, is maximum if the number of vertices belonging to some member of P is maximum, over all G-packings. The analogous problem for undirected graphs has been extensively studied in the literature. We concentrate on the cases wh...
متن کاملSaving time saves lives.
C onsider the following 3 patient stories: Reluctantly, A.B. heaved his bulk out of the air-conditioned car and into the hot, bright afternoon sun. The walk across the steaming macadam parking lot left him breathless, and his hand shook as he buried the cigarette butt into the sand on top of the shining brass receptacle guarding the entrance to the casino. His head pounded with the exertion, an...
متن کاملDynamic Tail Packing Scheme Saves Space up to 64 %
The problem of low space utilization (Fig. 1). E mbedded/mobile computing systems are usually battery-powered devices and are widely adopted in various application domains. Due to cost and energy considerations, they usually have limited computing power, RAM space, and storage capacity. However, recent improvements in embedded/ mobile computing systems' computing ability have allowed some embed...
متن کاملPacking Non-Returning A-Paths
Chudnovsky et al. gave a min-max formula for the maximum number of node-disjoint non-zero A-paths in group-labeled graphs [1], which is a generalization of Mader’s theorem on node-disjoint A-paths [3]. Here we present a further generalization with a shorter proof. The main feature of Theorem 2.1 is that parity is “hidden” inside ν̂, which is given by an oracle for non-bipartite matching.
متن کاملHonesty saves time (and justifications)
The study of active lying poses considerable methodological challenges, especially regarding suitable experimental designs to prompt dishonest responses. This aim is often achieved by instructing participants whether to lie or to be honest in a given situation (e.g., Spence et al., 2001; Walczyk et al., 2003). Shalvi and colleagues have recently promoted a striking alternative approach which al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.008